MPC-MPNet: Model-Predictive Motion Planning Networks for Fast, Near-Optimal Planning Under Kinodynamic Constraints

نویسندگان

چکیده

Kinodynamic Motion Planning (KMP) is to find a robot motion subject concurrent kinematics and dynamics constraints. To date, quite few methods solve KMP problems those that exist struggle near-optimal solutions exhibit high computational complexity as the planning space dimensionality increases. address these challenges, we present scalable, imitation learning-based, Model-Predictive Networks framework quickly finds path with worst-case theoretical guarantees under kinodynamic constraints for practical underactuated systems. Our introduces two algorithms built on neural generator, discriminator, parallelizable Model Predictive Controller (MPC). The generator outputs various informed states towards given target, discriminator selects best possible subset from them extension. MPC locally connects selected while satisfying leading feasible, solutions. We evaluate our range of cluttered, kinodynamically constrained, results indicating significant improvements in computation times, qualities, success rates over existing methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kinodynamic Motion Planning 1 Kinodynamic Motion Planning 5

Kinodynamic planning attempts to solve a robot motion problem subject to simultaneous kinematic and dynamics constraints. In the general problem, given a robot system, we must nd a minimal-time trajectory that goes from a start position and velocity to a goal position and velocity while avoiding obstacles by a safety margin and respecting constraints on velocity and acceleration. We consider th...

متن کامل

A Generalized Label Correcting Method for Optimal Kinodynamic Motion Planning

A resolution complete optimal kinodynamic motion planning algorithm is presented and described as a generalized label correcting (GLC) method. In contrast to related algorithms, the GLC method does not require a local planning subroutine and benefits from a simple implementation. The key contributions of this paper are the construction and analysis of theGLC conditions which are the basis of th...

متن کامل

Asymptotically Optimal Kinodynamic Motion Planning for Self-reconfigurable Robots

Self-reconfigurable robots are composed of many individual modules that can autonomously move to transform the shape and structure of the robot. In this paper we present a kinodynamically optimal algorithm for the following “x-axis to yaxis” reconfiguration problem: given a horizontal row of n modules, reconfigure that collection into a vertical column of n modules. The goal is to determine the...

متن کامل

The Generalized Label Correcting Method for Optimal Kinodynamic Motion Planning

Nearly all autonomous robotic systems use some form of motion planning to compute reference motions through their environment. An increasing use of autonomous robots in a broad range of applications creates a need for efficient, general purpose motion planning algorithms that are applicable in any of these new application domains. This thesis presents a resolution complete optimal kinodynamic m...

متن کامل

Kinodynamic RRT*: Optimal Motion Planning for Systems with Linear Differential Constraints

We present Kinodynamic RRT*, an incremental sampling-based approach for asymptotically optimal motion planning for robots with linear differential constraints. Our approach extends RRT*, which was introduced for holonomic robots [8], by using a fixed-final-statefree-final-time controller that exactly and optimally connects any pair of states, where the cost function is expressed as a trade-off ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE robotics and automation letters

سال: 2021

ISSN: ['2377-3766']

DOI: https://doi.org/10.1109/lra.2021.3067847